On the Semantics of Temporal Logic Programming (Preliminary Repart)

Recently, several researchers have suggested directly exploiting in a programming language temporal logic’s ability to describe changing worlds. The resulting languages are quite diverse. Tl+ey are based on different subsets of temporal logic and use a variety of execution mechanisms. . So far, little attention has been paid to the formal semantics of these languages. In this paper, we study the semantics of an instance of temporal logic programming, namely, the TEMPLOG language defined by Abadi and Manna. We first give declarative semantics for TEMPLOG, in model-theoretic and in fixpoint terms. Then, we study its operational semantics and prove A soundness and completeness theorems for the temporal-resolution proof method underlying its execution met hanism. This research was supported by the National Science Foundation under Grants DCR-84-13230 and DCR-86-11272, by the Defense Advanced Research Projects Agency under Contract N00039-84-C0211, and by the United States Air Force Office of Scientific Research under Contract AFOSR-870149.